-
1 colorable set
Большой англо-русский и русско-английский словарь > colorable set
-
2 colorable set
Математика: раскрашиваемое множество -
3 colorable set
-
4 colorable
геом. раскрашиваемый uniquely colorable graph ≈ однозначно раскрашиваемый граф - colorable graph - colorable set - uniquely colorable a
1) поддающийся окpаске;
2) благовидный, пpавдоподобныйБольшой англо-русский и русско-английский словарь > colorable
-
5 set
1) набор; комплект- semiconductor assembly set - set of Belleville springs - set of conventional set - set of drawing instruments - set of gate patterns - set of gauge blocks - set of logical elements - set of statistical data - set of technical aids- snap set2) партия3) совокупность; множество4) установка; агрегат- desk telephone set - dial telephone set- gear set- local-battery telephone set - man-pack radio set - multi-operator welding set - sound-powered telephone set - wall telephone set5) регулировка; настройка || регулировать; настраивать6) группа; ансамбль7) класс; семейство9) схватывание || схватываться10) затвердевание || затвердевать11) крепление || закреплять12) геол. свита пород13) осадка (грунта) || оседать ( о грунте)14) радиоточка15) спорт сет16) включать, приводить в действие17) мат. множествоset closed under operation — множество, замкнутое относительно операции
- absolutely compact set - absolutely continuous set - absolutely convex set - absolutely irreducible set - absolutely measurable set - affinely independent set - affinely invariant set - algebraically independent set - almost finite set - almost full set - angular cluster set - asymptotically indecomposable set - at most denumerable set - centro-symmetric set - completely bounded set - completely continuous set - completely generating set - completely improper set - completely irreducible set - completely nonatomic set - completely normal set - completely ordered set - completely productive set - completely reducible set - completely separable set - constructively nonrecursive set - convexly independent set - countably infinite setto set aside — не учитывать, не принимать во внимание; откладывать
- cut set- cyclically ordered set - deductively inconsistent set - derived set - doubly well-ordered set - dual set of equations - dynamically disconnected set - effectively enumerable set - effectively generating set - effectively nonrecursive set - effectively simple set - enumeration reducible set - finely perfect set - finitely definite set - finitely measurable set- flat set- full set- fully reducible set - functionally closed set - functionally complete set - functionally open set - fundamental probability set - generalized almost periodic set- goal set- internally stable set- knot set- left directed set - left normal set - left-hand cluster set - linearly ordered set - local peak set - locally arcwise set - locally closed set - locally compact set - locally connected set - locally contractible set - locally convex set - locally finite set - locally invariant set - locally negligible set - locally null set - locally polar set - locally polyhedral set - metrically bounded set - metrically dense set - multiply ordered set - nearly analytic set - nearly closed set - nonvoid set - normally ordered set- null set- open in rays set - partitioned data set- peak set- pole set- positively homothetic set- pure set- radially open set - rationally independent set - recursively creative set - recursively indecomposable set - recursively isomorphic set - recursively productive set - regularly convex set - regularly situated sets - relatively closed set - relatively compact set - relatively dense set - relatively interpretable set - relatively open set - right normal set - right-hand cluster set- scar set- sequentially complete set - serially ordered set - set of elementary events - set of first category - set of first kind - set of first species - set of possible outcomes - set of probability null - set of second category - set of second species - shift invariant set - simply connected set - simply ordered set - simply transitive set- skew set- star set- strongly bounded set - strongly closed set - strongly compact set - strongly connected set - strongly convex set - strongly dependent set - strongly disjoint sets - strongly enumerable set - strongly independent set - strongly minimal set - strongly polar set - strongly reducible set - strongly separated set - strongly simple set - strongly stratified set- tame set- tautologically complete set - tautologically consistent set - tautologically inconsistent set- test set- thin set- tie set- time set- totally disconnected set - totally imperfect set - totally ordered set - totally primitive set - totally unimodular set - totally unordered set - truth-table reducible set - uniformly bounded set - uniformly continuous set - uniformly convergent set - uniformly integrable set - uniformly universal set - unilaterally connected set- unit set- vacuous set- void set- weakly compact set - weakly convex set - weakly n-dimensional set - weakly stratified set - weakly wandering set - well chained set - well founded set - well measurable set - well ordering set - well quasiordered set -
6 раскрашиваемый
colorable set мат. -
7 раскрашиваемое множество
colorable set мат.Русско-английский научно-технический словарь Масловского > раскрашиваемое множество
-
8 раскрашиваемое множество
Большой англо-русский и русско-английский словарь > раскрашиваемое множество
-
9 раскрашиваемое множество
Mathematics: colorable setУниверсальный русско-английский словарь > раскрашиваемое множество
См. также в других словарях:
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Four color theorem — Example of a four colored map A four colori … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Philippine Trademark Law — R.A. 8293, otherwise known as the Intellectual Property Code, defines a trademark as “any visible sign capable of distinguishing goods.” Early jurisprudence has taken it to mean “a sign, device or mark by which the articles produced or dealt in… … Wikipedia
Cycle graph — This article is about connected, 2 regular graphs. For other uses, see Cycle graph (disambiguation). Cycle graph A cycle graph of length 6 Vertices n … Wikipedia
Dilworth's theorem — In mathematics, in the areas of order theory and combinatorics, Dilworth s theorem characterizes the width of any finite partially ordered set in terms of a partition of the order into a minimum number of chains. It is named for the mathematician … Wikipedia
De Bruijn–Erdős theorem (graph theory) — This article is about coloring infinite graphs. For the number of lines determined by a finite set of points, see De Bruijn–Erdős theorem (incidence geometry). In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and… … Wikipedia
plausible — plausible, credible, believable, colorable, specious are comparable when they mean capable of impressing the observer, auditor, or reader as truly or genuinely possessing the quality or character that is set forth or claimed. A thing or sometimes … New Dictionary of Synonyms
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Triangle-free graph — In the mathematical area of graph theory, a triangle free graph is an undirected graph in which no three vertices form a triangle of edges. Triangle free graphs may be equivalently defined as graphs with clique number ≤ 2, graphs with girth ≥ 4,… … Wikipedia
Cycle double cover — Unsolved problems in mathematics Does every bridgeless graph have a multiset of cycles covering every edge exactly twice? … Wikipedia
